An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
نویسندگان
چکیده
منابع مشابه
A best on-line algorithm for single machine scheduling with small delivery times
We consider a single machine on-line scheduling problem with delivery times. All jobs arrive over time. Each job’s characteristics, such as processing time and delivery time, become known at its arrival time. Once the processing of a job is completed we deliver it to the destination by a vehicle. The objective is to minimize the time by which all jobs have been delivered. In this paper, we assu...
متن کاملParallel machine scheduling with batch delivery costs
We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on m parallel machines. The jobs are delivered in batches and the delivery date of a batch is equal to the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total #ow time and delivery cost. W...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملAn improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...
متن کاملAn Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling
| Jobs arriving over time must be nonpreemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) on-line heuristic is a simple extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.002